________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 10:50:15
Input Data from:  dataset142.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :100
# of Locations  :20
Ex.Facilities   :2
Total budget    :25000
Terror. attacks :3

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,173
Average f[i]   :4750
Average g[i,j] :1986,11111111111
Total demand   :4950
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 19
> Selected Move:	0	1	-1	2	4000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 18
> Selected Move:	300	1	-1	3	9500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 300


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 81
> Selected Move:	1380	1	-1	5	15000


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1380


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 97
> Selected Move:	1750	1	-1	7	21000


> New Y[]: 
	
	 2  3  1  1  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1750


> New S[]: 
	
	 0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 90
> Selected Move:	1990	3	3	8	20500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1990


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 106
> Selected Move:	2430	1	-1	19	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  0  0  0  0  0  0  0  0  0  0  1    >new incumb.: 2430


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 93
> Selected Move:	2450	3	2	12	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  0  0  1  0  0  0  0  0  0  1    >new incumb.: 2450


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 76
> Selected Move:	2470	3	7	6	25000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  1  0  0  0  1  0  0  0  0  0  0  1    >new incumb.: 2470


> New S[]: 
	
	 0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 77
> Selected Move:	2470	3	6	13	24000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  0  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 98
> Selected Move:	2700	3	5	15	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  1  1  0  1  0  0  0  1    >new incumb.: 2700


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 100
> Selected Move:	2590	3	19	17	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  1  1  0  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 101
> Selected Move:	2540	3	17	16	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  1  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 101
> Selected Move:	2490	3	16	2	24000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 100
> Selected Move:	2500	3	8	10	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 88
> Selected Move:	2500	3	15	8	24000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  1  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 102
> Selected Move:	2520	3	2	19	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  0  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 103
> Selected Move:	2490	3	19	4	24500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  1  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 98
> Selected Move:	2420	3	10	15	24500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 96
> Selected Move:	2500	3	4	14	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  1  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 86
> Selected Move:	2400	3	8	19	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  1  1  1  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 86
> Selected Move:	2470	3	14	5	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  0  1  1  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 75
> Selected Move:	2390	3	5	2	23500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  0  1  1  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 95
> Selected Move:	2450	3	12	17	24000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 99
> Selected Move:	2480	3	13	7	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 87
> Selected Move:	2390	3	17	12	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 86
> Selected Move:	2398	3	2	8	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 85
> Selected Move:	2400	3	15	14	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 97
> Selected Move:	2400	3	7	13	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  1  1  1  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 98
> Selected Move:	2380	3	19	2	23500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 103
> Selected Move:	2380	3	2	4	24000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 97
> Selected Move:	2380	3	8	15	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  0  1  1  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 85
> Selected Move:	2390	3	14	19	24000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  0  1  1  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 93
> Selected Move:	2450	3	12	17	24500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  0  0  1  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 99
> Selected Move:	2460	3	4	8	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 99
> Selected Move:	2610	3	15	5	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  0  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 101
> Selected Move:	2580	3	17	16	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  0  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 105
> Selected Move:	2450	3	5	10	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  0  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 109
> Selected Move:	2460	3	16	17	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  0  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 107
> Selected Move:	2360	3	19	2	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  1  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 108
> Selected Move:	2380	3	10	5	24000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0  0  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 106
> Selected Move:	2430	3	17	19	24000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 103
> Selected Move:	2360	3	2	4	24500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  1  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 104
> Selected Move:	2310	3	19	17	24500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  1  0  0  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 105
> Selected Move:	2300	3	8	19	24000


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  0  0  0  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 102
> Selected Move:	2300	3	4	2	23500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 102
> Selected Move:	2340	3	17	15	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 94
> Selected Move:	2380	3	5	16	24000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 102
> Selected Move:	2380	3	2	4	24500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  0  0  1  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 102
> Selected Move:	2360	3	4	8	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  0  1  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 105
> Selected Move:	2345	3	16	3	26000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 90
> Selected Move:	2300	3	19	12	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 79
> Selected Move:	2405	3	3	10	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 101
> Selected Move:	2385	3	8	19	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  1  1  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 97
> Selected Move:	2390	3	15	2	23500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 112
> Selected Move:	2390	3	2	4	24000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  1  0  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 55 #######################


> Neighbours evaluated; 109
> Selected Move:	2390	3	13	7	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 56 #######################


> Neighbours evaluated; 103
> Selected Move:	2395	3	4	8	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 57 #######################


> Neighbours evaluated; 101
> Selected Move:	2393	3	7	6	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 58 #######################


> Neighbours evaluated; 98
> Selected Move:	2450	3	10	15	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0 
 > pw :0,265

## ITERATION 59 #######################


> Neighbours evaluated; 93
> Selected Move:	2408	3	19	17	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  0  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,27

## ITERATION 60 #######################


> Neighbours evaluated; 97
> Selected Move:	2340	3	15	13	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  0  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 61 #######################


> Neighbours evaluated; 107
> Selected Move:	2310	3	6	10	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  0  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 62 #######################


> Neighbours evaluated; 112
> Selected Move:	2310	3	17	16	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 63 #######################


> Neighbours evaluated; 113
> Selected Move:	2350	3	12	2	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 64 #######################


> Neighbours evaluated; 112
> Selected Move:	2330	3	10	5	24000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0  0  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 65 #######################


> Neighbours evaluated; 111
> Selected Move:	2360	3	16	14	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0  0  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 66 #######################


> Neighbours evaluated; 105
> Selected Move:	2330	3	2	12	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 67 #######################


> Neighbours evaluated; 100
> Selected Move:	2343	3	14	15	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 68 #######################


> Neighbours evaluated; 100
> Selected Move:	2340	2	5	-1	20000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 69 #######################


> Neighbours evaluated; 97
> Selected Move:	2340	3	1	6	22500


> New Y[]: 
	
	 2  0  0  0  0  0  3  0  1  0  0  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 70 #######################


> Neighbours evaluated; 97
> Selected Move:	2340	4	6	8	22600


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  3  0  0  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 71 #######################


> Neighbours evaluated; 96
> Selected Move:	2340	4	8	12	23600


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  1  0  0  0  3  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 72 #######################


> Neighbours evaluated; 92
> Selected Move:	2340	4	12	13	23000


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  1  0  0  0  1  3  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 73 #######################


> Neighbours evaluated; 94
> Selected Move:	2340	4	13	15	21800


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  1  0  0  0  1  1  0  3  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 74 #######################


> Neighbours evaluated; 98
> Selected Move:	2414	1	-1	19	26300


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  1  0  0  0  1  1  0  3  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 75 #######################


> Neighbours evaluated; 95
> Selected Move:	2326	3	8	2	25300


> New Y[]: 
	
	 2  0  1  0  0  0  1  0  0  0  0  0  1  1  0  3  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,21

## ITERATION 76 #######################


> Neighbours evaluated; 92
> Selected Move:	2322	3	19	8	25800


> New Y[]: 
	
	 2  0  1  0  0  0  1  0  1  0  0  0  1  1  0  3  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 77 #######################


> Neighbours evaluated; 99
> Selected Move:	2324	3	2	17	26300


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  1  0  0  0  1  1  0  3  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,2

## ITERATION 78 #######################


> Neighbours evaluated; 103
> Selected Move:	2280	3	17	16	26300


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  1  0  0  0  1  1  0  3  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 79 #######################


> Neighbours evaluated; 104
> Selected Move:	2249	3	16	14	27300


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  1  0  0  0  1  1  1  3  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 80 #######################


> Neighbours evaluated; 93
> Selected Move:	2205	3	15	1	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 81 #######################


> Neighbours evaluated; 99
> Selected Move:	2398	3	13	15	26500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 82 #######################


> Neighbours evaluated; 93
> Selected Move:	2300	3	15	19	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  0  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 83 #######################


> Neighbours evaluated; 104
> Selected Move:	2330	3	6	5	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  0  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,23

## ITERATION 84 #######################


> Neighbours evaluated; 112
> Selected Move:	2345	3	12	13	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  0  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 85 #######################


> Neighbours evaluated; 103
> Selected Move:	2330	3	8	12	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  0  1  1  1  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,24

## ITERATION 86 #######################


> Neighbours evaluated; 96
> Selected Move:	2350	3	14	9	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,245

## ITERATION 87 #######################


> Neighbours evaluated; 102
> Selected Move:	2358	3	5	10	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  0  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 88 #######################


> Neighbours evaluated; 104
> Selected Move:	2355	3	10	15	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  0  1  1  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,255

## ITERATION 89 #######################


> Neighbours evaluated; 95
> Selected Move:	2270	3	9	17	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  1  1  0  1  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,26

## ITERATION 90 #######################


> Neighbours evaluated; 93
> Selected Move:	2300	3	12	5	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  0  0  1  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 91 #######################


> Neighbours evaluated; 94
> Selected Move:	2300	3	13	2	24500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,26

## ITERATION 92 #######################


> Neighbours evaluated; 102
> Selected Move:	2300	3	2	4	25000


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,255

## ITERATION 93 #######################


> Neighbours evaluated; 102
> Selected Move:	2353	3	5	7	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 94 #######################


> Neighbours evaluated; 94
> Selected Move:	2390	3	17	12	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,255

## ITERATION 95 #######################


> Neighbours evaluated; 94
> Selected Move:	2270	3	4	17	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  0  0  1  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1 
 > pw :0,25

## ITERATION 96 #######################


> Neighbours evaluated; 91
> Selected Move:	2270	3	7	6	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  1  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,245

## ITERATION 97 #######################


> Neighbours evaluated; 97
> Selected Move:	2270	3	6	8	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,24

## ITERATION 98 #######################


> Neighbours evaluated; 109
> Selected Move:	2320	3	17	5	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 99 #######################


> Neighbours evaluated; 109
> Selected Move:	2270	3	15	10	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,23

## ITERATION 100 #######################


> Neighbours evaluated; 112
> Selected Move:	2270	3	5	17	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 101 #######################


> Neighbours evaluated; 113
> Selected Move:	2270	3	8	6	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 102 #######################


> Neighbours evaluated; 109
> Selected Move:	2270	3	6	7	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1 
 > pw :0,215

## ITERATION 103 #######################


> Neighbours evaluated; 104
> Selected Move:	2390	3	17	2	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 104 #######################


> Neighbours evaluated; 106
> Selected Move:	2390	3	19	8	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 105 #######################


> Neighbours evaluated; 107
> Selected Move:	2390	3	10	15	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,2

## ITERATION 106 #######################


> Neighbours evaluated; 106
> Selected Move:	2380	3	15	14	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  0  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 107 #######################


> Neighbours evaluated; 109
> Selected Move:	2380	3	2	4	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  0  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 108 #######################


> Neighbours evaluated; 110
> Selected Move:	2335	3	4	13	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,185

## ITERATION 109 #######################


> Neighbours evaluated; 107
> Selected Move:	2340	3	8	19	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  0  0  1  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,18

## ITERATION 110 #######################


> Neighbours evaluated; 99
> Selected Move:	2340	3	14	5	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  0  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 111 #######################


> Neighbours evaluated; 100
> Selected Move:	2343	3	19	8	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  0  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 112 #######################


> Neighbours evaluated; 111
> Selected Move:	2360	3	12	17	26000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  0  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 113 #######################


> Neighbours evaluated; 109
> Selected Move:	2508	3	13	19	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,16

## ITERATION 114 #######################


> Neighbours evaluated; 112
> Selected Move:	2480	3	17	16	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  0  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,165

## ITERATION 115 #######################


> Neighbours evaluated; 113
> Selected Move:	2330	3	19	2	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  0  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 116 #######################


> Neighbours evaluated; 108
> Selected Move:	2380	3	16	17	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  0  0  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 117 #######################


> Neighbours evaluated; 105
> Selected Move:	2300	3	8	19	24500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 118 #######################


> Neighbours evaluated; 110
> Selected Move:	2300	3	2	4	25000


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  0  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 119 #######################


> Neighbours evaluated; 106
> Selected Move:	2273	3	17	8	25500


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 120 #######################


> Neighbours evaluated; 104
> Selected Move:	2280	2	4	-1	21000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 121 #######################


> Neighbours evaluated; 102
> Selected Move:	2280	3	1	6	23500


> New Y[]: 
	
	 2  0  0  0  0  1  3  1  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 122 #######################


> Neighbours evaluated; 83
> Selected Move:	2280	4	6	5	23100


> New Y[]: 
	
	 2  0  0  0  0  3  1  1  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 123 #######################


> Neighbours evaluated; 86
> Selected Move:	2280	4	5	7	23100


> New Y[]: 
	
	 2  0  0  0  0  1  1  3  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 124 #######################


> Neighbours evaluated; 86
> Selected Move:	2280	4	7	8	23600


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  3  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 125 #######################


> Neighbours evaluated; 81
> Selected Move:	2280	4	8	19	24600


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  1  0  0  0  0  0  0  0  0  0  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 126 #######################


> Neighbours evaluated; 84
> Selected Move:	2170	3	19	14	25000


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  1  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  1  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 127 #######################


> Neighbours evaluated; 82
> Selected Move:	2170	4	14	5	24100


> New Y[]: 
	
	 2  0  0  0  0  3  1  1  1  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  1  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 128 #######################


> Neighbours evaluated; 86
> Selected Move:	2170	4	5	6	24500


> New Y[]: 
	
	 2  0  0  0  0  1  3  1  1  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  1  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 129 #######################


> Neighbours evaluated; 85
> Selected Move:	2170	4	6	7	24100


> New Y[]: 
	
	 2  0  0  0  0  1  1  3  1  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  1  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 130 #######################


> Neighbours evaluated; 86
> Selected Move:	2170	4	7	8	24600


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  3  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  1  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 131 #######################


> Neighbours evaluated; 86
> Selected Move:	2170	3	7	13	23600


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  3  0  0  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 132 #######################


> Neighbours evaluated; 89
> Selected Move:	2170	4	8	5	23100


> New Y[]: 
	
	 2  0  0  0  0  3  1  0  1  0  0  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 133 #######################


> Neighbours evaluated; 87
> Selected Move:	2210	3	0	12	24900


> New Y[]: 
	
	 0  0  0  0  0  3  1  0  1  0  0  0  2  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 134 #######################


> Neighbours evaluated; 88
> Selected Move:	2210	4	5	12	24900


> New Y[]: 
	
	 0  0  0  0  0  2  1  0  1  0  0  0  3  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 135 #######################


> Neighbours evaluated; 88
> Selected Move:	2210	4	5	6	24900


> New Y[]: 
	
	 0  0  0  0  0  1  2  0  1  0  0  0  3  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 136 #######################


> Neighbours evaluated; 89
> Selected Move:	2210	4	12	5	23400


> New Y[]: 
	
	 0  0  0  0  0  3  2  0  1  0  0  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 137 #######################


> Neighbours evaluated; 87
> Selected Move:	2210	4	5	6	23800


> New Y[]: 
	
	 0  0  0  0  0  2  3  0  1  0  0  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 138 #######################


> Neighbours evaluated; 87
> Selected Move:	2210	4	5	8	24400


> New Y[]: 
	
	 0  0  0  0  0  1  3  0  2  0  0  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 139 #######################


> Neighbours evaluated; 89
> Selected Move:	2210	4	6	5	24000


> New Y[]: 
	
	 0  0  0  0  0  3  1  0  2  0  0  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 140 #######################


> Neighbours evaluated; 86
> Selected Move:	2210	4	5	8	23900


> New Y[]: 
	
	 0  0  0  0  0  2  1  0  3  0  0  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 141 #######################


> Neighbours evaluated; 86
> Selected Move:	2210	4	5	6	23900


> New Y[]: 
	
	 0  0  0  0  0  1  2  0  3  0  0  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 142 #######################


> Neighbours evaluated; 85
> Selected Move:	2210	4	6	13	24500


> New Y[]: 
	
	 0  0  0  0  0  1  1  0  3  0  0  0  1  2  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 143 #######################


> Neighbours evaluated; 88
> Selected Move:	2210	4	8	5	24000


> New Y[]: 
	
	 0  0  0  0  0  3  1  0  1  0  0  0  1  2  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,0699999999999996

## ITERATION 144 #######################


> Neighbours evaluated; 85
> Selected Move:	2215	1	-1	19	28500


> New Y[]: 
	
	 0  0  0  0  0  3  1  0  1  0  0  0  1  2  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,0649999999999996

## ITERATION 145 #######################


> Neighbours evaluated; 107
> Selected Move:	2338	3	14	17	27500


> New Y[]: 
	
	 0  0  0  0  0  3  1  0  1  0  0  0  1  2  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,0599999999999996

## ITERATION 146 #######################


> Neighbours evaluated; 107
> Selected Move:	2400	3	12	11	29500


> New Y[]: 
	
	 0  0  0  0  0  3  1  0  1  0  0  1  0  2  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0 
 > pw :0,0549999999999996

## ITERATION 147 #######################


> Neighbours evaluated; 105
> Selected Move:	2472	4	13	11	28600


> New Y[]: 
	
	 0  0  0  0  0  3  1  0  1  0  0  2  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0 
 > pw :0,0499999999999996

## ITERATION 148 #######################


> Neighbours evaluated; 106
> Selected Move:	2530	3	11	0	26600


> New Y[]: 
	
	 2  0  0  0  0  3  1  0  1  0  0  0  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,0549999999999996

## ITERATION 149 #######################


> Neighbours evaluated; 111
> Selected Move:	2512	1	-1	2	30600


> New Y[]: 
	
	 2  0  1  0  0  3  1  0  1  0  0  0  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,0599999999999996

## ITERATION 150 #######################


> Neighbours evaluated; 114
> Selected Move:	2534	1	-1	7	36600


> New Y[]: 
	
	 2  0  1  0  0  3  1  1  1  0  0  0  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,0649999999999996

## ITERATION 151 #######################


> Neighbours evaluated; 118
> Selected Move:	2483	3	5	15	36800


> New Y[]: 
	
	 2  0  1  0  0  0  1  1  1  0  0  0  0  1  0  3  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0 
 > pw :0,0699999999999996

## ITERATION 152 #######################


> Neighbours evaluated; 114
> Selected Move:	2464	2	2	-1	32800


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  1  0  0  0  0  1  0  3  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  1 
 > pw :0,0749999999999996

## ITERATION 153 #######################


> Neighbours evaluated; 105
> Selected Move:	2515	3	7	12	30800


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  1  0  0  0  1  1  0  3  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,0799999999999996

## ITERATION 154 #######################


> Neighbours evaluated; 113
> Selected Move:	2510	3	15	1	29000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  0  1  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,0849999999999996

## ITERATION 155 #######################


> Neighbours evaluated; 118
> Selected Move:	2610	3	6	15	29000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  1  1  0  1  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,0899999999999996

## ITERATION 156 #######################


> Neighbours evaluated; 118
> Selected Move:	2540	3	17	16	29000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  1  1  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 157 #######################


> Neighbours evaluated; 123
> Selected Move:	2518	3	16	2	28500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  0  1  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 158 #######################


> Neighbours evaluated; 118
> Selected Move:	2470	3	2	14	30000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  1  1  1  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 159 #######################


> Neighbours evaluated; 117
> Selected Move:	2398	3	19	2	29500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  0  1  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 160 #######################


> Neighbours evaluated; 118
> Selected Move:	2380	2	8	-1	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  0  1  1  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,115

## ITERATION 161 #######################


> Neighbours evaluated; 108
> Selected Move:	2323	3	13	7	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,12

## ITERATION 162 #######################


> Neighbours evaluated; 107
> Selected Move:	2410	3	2	8	26500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,125

## ITERATION 163 #######################


> Neighbours evaluated; 110
> Selected Move:	2430	3	14	10	27000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 164 #######################


> Neighbours evaluated; 108
> Selected Move:	2420	3	7	6	27000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 165 #######################


> Neighbours evaluated; 107
> Selected Move:	2318	3	8	19	26500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,14

## ITERATION 166 #######################


> Neighbours evaluated; 105
> Selected Move:	2330	3	10	5	26000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,145

## ITERATION 167 #######################


> Neighbours evaluated; 105
> Selected Move:	2305	3	6	7	26000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1 
 > pw :0,15

## ITERATION 168 #######################


> Neighbours evaluated; 98
> Selected Move:	2295	3	5	10	26500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,155

## ITERATION 169 #######################


> Neighbours evaluated; 100
> Selected Move:	2263	3	10	13	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  0  0  1  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0 
 > pw :0,16

## ITERATION 170 #######################


> Neighbours evaluated; 85
> Selected Move:	2340	3	15	8	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 171 #######################


> Neighbours evaluated; 107
> Selected Move:	2340	3	12	17	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,17

## ITERATION 172 #######################


> Neighbours evaluated; 114
> Selected Move:	2350	3	7	11	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 173 #######################


> Neighbours evaluated; 109
> Selected Move:	2418	3	17	15	26500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  1 
 > pw :0,18

## ITERATION 174 #######################


> Neighbours evaluated; 101
> Selected Move:	2350	3	19	17	26500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,185

## ITERATION 175 #######################


> Neighbours evaluated; 103
> Selected Move:	2385	3	11	3	26000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  0  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 176 #######################


> Neighbours evaluated; 98
> Selected Move:	2350	3	17	16	26000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 177 #######################


> Neighbours evaluated; 99
> Selected Move:	2323	3	16	2	25500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 178 #######################


> Neighbours evaluated; 100
> Selected Move:	2290	3	3	11	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  1  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,205

## ITERATION 179 #######################


> Neighbours evaluated; 106
> Selected Move:	2283	3	2	16	26500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,21

## ITERATION 180 #######################


> Neighbours evaluated; 99
> Selected Move:	2320	3	15	19	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 181 #######################


> Neighbours evaluated; 104
> Selected Move:	2320	3	11	7	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,22

## ITERATION 182 #######################


> Neighbours evaluated; 109
> Selected Move:	2230	3	7	3	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  0  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 183 #######################


> Neighbours evaluated; 109
> Selected Move:	2260	3	16	2	24000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 184 #######################


> Neighbours evaluated; 105
> Selected Move:	2280	3	3	11	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  1  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 185 #######################


> Neighbours evaluated; 111
> Selected Move:	2250	3	11	12	22500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 186 #######################


> Neighbours evaluated; 106
> Selected Move:	2270	3	2	17	23000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  1  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 187 #######################


> Neighbours evaluated; 97
> Selected Move:	2500	3	0	5	24800


> New Y[]: 
	
	 0  3  0  0  0  2  0  0  1  0  0  0  1  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 188 #######################


> Neighbours evaluated; 107
> Selected Move:	2460	3	5	15	25000


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  1  0  0  0  1  1  0  2  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 189 #######################


> Neighbours evaluated; 100
> Selected Move:	2395	3	17	3	26000


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  1  0  0  0  1  1  0  2  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,21

## ITERATION 190 #######################


> Neighbours evaluated; 100
> Selected Move:	2300	3	3	16	25000


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  1  0  0  0  1  1  0  2  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,205

## ITERATION 191 #######################


> Neighbours evaluated; 101
> Selected Move:	2300	3	15	5	24800


> New Y[]: 
	
	 0  3  0  0  0  2  0  0  1  0  0  0  1  1  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 192 #######################


> Neighbours evaluated; 110
> Selected Move:	2300	3	16	14	25800


> New Y[]: 
	
	 0  3  0  0  0  2  0  0  1  0  0  0  1  1  1  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 193 #######################


> Neighbours evaluated; 105
> Selected Move:	2302	3	19	2	25300


> New Y[]: 
	
	 0  3  1  0  0  2  0  0  1  0  0  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 194 #######################


> Neighbours evaluated; 99
> Selected Move:	2250	3	14	19	24300


> New Y[]: 
	
	 0  3  1  0  0  2  0  0  1  0  0  0  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 195 #######################


> Neighbours evaluated; 102
> Selected Move:	2285	3	8	15	25300


> New Y[]: 
	
	 0  3  1  0  0  2  0  0  0  0  0  0  1  1  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 196 #######################


> Neighbours evaluated; 95
> Selected Move:	2340	4	5	15	25000


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  0  0  0  0  1  1  0  2  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 197 #######################


> Neighbours evaluated; 101
> Selected Move:	2343	3	2	17	25500


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  0  0  0  1  1  0  2  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 198 #######################


> Neighbours evaluated; 98
> Selected Move:	2428	3	15	8	25400


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  2  0  0  0  1  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 199 #######################


> Neighbours evaluated; 106
> Selected Move:	2426	4	8	13	25400


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  1  0  0  0  1  2  0  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 200 #######################


> Neighbours evaluated; 106
> Selected Move:	2367	4	13	19	25700


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  1  0  0  0  1  1  0  0  0  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 201 #######################


> Neighbours evaluated; 105
> Selected Move:	2305	4	19	17	26000


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  1  0  0  0  1  1  0  0  0  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 202 #######################


> Neighbours evaluated; 103
> Selected Move:	2260	3	17	10	25700


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  1  0  2  0  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 203 #######################


> Neighbours evaluated; 104
> Selected Move:	2290	3	5	16	24700


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  1  0  2  0  1  1  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 204 #######################


> Neighbours evaluated; 110
> Selected Move:	2290	3	16	17	24700


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  1  0  2  0  1  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 205 #######################


> Neighbours evaluated; 108
> Selected Move:	2254	3	10	7	25400


> New Y[]: 
	
	 0  3  0  0  0  0  0  2  1  0  0  0  1  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0 
 > pw :0,22

## ITERATION 206 #######################


> Neighbours evaluated; 86
> Selected Move:	2302	3	13	5	25900


> New Y[]: 
	
	 0  3  0  0  0  1  0  2  1  0  0  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 207 #######################


> Neighbours evaluated; 94
> Selected Move:	2320	4	7	5	25800


> New Y[]: 
	
	 0  3  0  0  0  2  0  1  1  0  0  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 208 #######################


> Neighbours evaluated; 96
> Selected Move:	2316	3	7	6	25800


> New Y[]: 
	
	 0  3  0  0  0  2  1  0  1  0  0  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 209 #######################


> Neighbours evaluated; 75
> Selected Move:	2312	4	5	6	25800


> New Y[]: 
	
	 0  3  0  0  0  1  2  0  1  0  0  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24
________________________________________________________________

Best solution found: 2700
Run Termination time: 31.01.2010 10:53:57
Run duration: 00:03:42.8750000
________________________________________________________________
